Fenchel Problem of Level Sets
نویسنده
چکیده
In the paper, the Fenchel problem of level sets in the smooth case is solved by deducing a new and “nice” geometric necessary and sufficient condition for the existence of a smooth convex function with the level sets of a given smooth pseudoconvex function. The main theorem is based on a general differential geometric tool, the space of paths defined on smooth manifolds. This approach provides a complete geometric characterization of a new subclass of pseudoconvex functions originated from analytical mechanics, and a new view on the convexlike and generalized convexlike mappings in the image analysis.
منابع مشابه
A New Fenchel Dual Problem in Vector Optimization
We introduce a new Fenchel dual for vector optimization problems inspired by the form of the Fenchel dual attached to the scalarized primal multiobjective problem. For the vector primal-dual pair we prove weak and strong duality. Furthermore, we recall two other Fenchel-type dual problems introduced in the past in the literature, in the vector case, and make a comparison among all three duals. ...
متن کاملDuality for composed convex functions with applications in location theory
In this paper we consider, in a general normed space, the optimization problem with the objective function being a composite of a convex and componentwise increasing function with a vector convex function. Perturbing the primal problem, we obtain, by means of the Fenchel-Rockafellar approach, a dual problem for it. The existence of strong duality is proved and the optimality conditions are deri...
متن کاملStrong and Converse Fenchel Duality for Vector Optimization Problems in Locally Convex Spaces
In relation to the vector optimization problem v-minx∈X(f + g ◦ A)(x), with f, g proper and cone-convex functions and A : X → Y a linear continuous operator between separated locally convex spaces, we define a general vector Fenchel-type dual problem. For the primal-dual pair we prove weak, and under appropriate regularity conditions, strong and converse duality. In the particular case when the...
متن کاملAsymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
We consider the DC optimization problem (P) inf x∈X {(f1(x) − f2(x)) + (g1(Ax) − g2(Ax))}, where f1, f2, g1 and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y respectively, and A is a linear continuous operator from X to Y . Adopting the standard convexification technique, a Fenchel dual problem of (P) is given. By using properties of the ep...
متن کاملDuality of functions defined in lineally convex sets
We introduce a duality, similar to the Fenchel transformation, of functions that are defined in lineally convex sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 157 شماره
صفحات -
تاریخ انتشار 2013